Transitive, Locally Finite Median Graphs with Finite Blocks

نویسندگان

  • Wilfried Imrich
  • Sandi Klavzar
چکیده

The subject of this paper are infinite, locally finite, vertex-transitive median graphs. It is shown that the finiteness of the Θ-classes of such graphs does not guarantee finite blocks. Blocks become finite if, in addition, no finite sequence of Θ-contractions produces new cut-vertices. It is proved that there are only finitely many vertex-transitive median graphs of given finite degree with finite blocks. An infinite family of vertex-transitive median graphs with finite intransitive blocks is also constructed and the list of vertex-transitive median graphs of degree four is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On locally finite transitive two - ended digraphs *

Since decades transitive graphs are a topic of great interest. The study of s-edge transitive (undirected) graphs goes back to Tutte [13], who showed that finite cubic graphs cannot be s-edge transitive for s> 5. Weiss [14] proved several years later that the only finite connected s-edge transitive graphs with s = 8 are the cycles. Considering directed graphs the situation is much more involved...

متن کامل

k-CS-transitive infinite graphs

a r t i c l e i n f o a b s t r a c t A graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic induced subgraphs A and B of Γ , each of size k, there is an automorphism of Γ taking A to B. The graph is called k-CS-homogeneous if any isomorphism between two connected induced subgraphs of size k extends to an automor-phism. We consider locally-finite infinite k-...

متن کامل

An Alexandroff topology on graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

متن کامل

Cycle-free Partial Orders and Ends of Graphs

The relationship between posets that are cycle-free and graphs that have more than one end is considered. We show that any locally finite bipartite graph corresponding to a cycle-free partial order has more than one end, by showing a correspondence between the ends of the graph and those of the Hasse graph of its Dedekind–MacNeille completion. If, in addition, the cycle-free partial order is k-...

متن کامل

A note on bounded automorphisms of infinite graphs

Let X be a connected locally finite graph with vertex-transitive automorphism group. If X has polynomial growth then the set of all bounded automorphisms of finite order is a locally finite, periodic normal subgroup of AUT(X) and the action of AUT(X) on V(X) is imprimitive if X is not finite. If X has infinitely many ends, the group of bounded automorphisms itself is locally finite and periodic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2009